Correction to: Polynomial-based method for determining coast-terminating zero of fuel-optimal time-fixed trajectory

Polynomial-time Matrix-based Method of Determining Subset Sum Solutions

There have been no known algorithms or methods to solve the value-unbounded, general-case subset sum problem in polynomial time. A naive algorithm performs in exponential time by cycling through the possible subsets of A until it has either seen all subsets or found one that sums to c. A common pseudo-polynomial algorithm employs a dynamic programming method whose complexity is polynomial with ...

An approach for simultaneously determining the optimal trajectory and control of a cancerous model

The main attempt of this article is extension the method so that it generallywould be able to consider the classical solution of the systems and moreover,produces the optimal trajectory and control directly at the same time. There-fore we consider a control system governed by a bone marrow cancer equation.Next, by extending the underlying space, the existence of the solution is con-sidered and ...

Minimum Fuel Trajectory in a 3/ D Time Scheduled Climb

Polynomial-time Method of Determining Subset Sum Solutions

Reducing the conditions under which a given set satisfies the stipulations of the subset sum proposition to a set of linear relationships, the question of whether a set satisfies subset sum may be answered in a polynomial number of steps by forming, solving, and constraining a series of linear systems whose dimensions and number are both polynomial with respect to the length of the set. Given i...

A polynomial time algorithm for determining zero Euler-Petrie genus of an Eulerian graph

A dual-eulerian graph is a plane graph which has an ordering defined on its edge set which forms simultaneously an Euler circuit in the graph and an euler circuit in the dual graph. Dual-eulerian graphs were defined and studied in the context of silicon optimization of cmos layouts. They are necessarily of low connectivity with exponentially many planar embeddings. We give a polynomial time alg...